A Few Assertions on Information Hiding

نویسنده

  • J Voas
چکیده

data types have little impact on software error masking as far as we can determine Inheritance is not necessarily detrimental to error masking however when combined with information hiding it may become lethal Unit testing costs increase as the depth of inheritance increases This is directly related to the increase in the number of drivers and stubs As a counter argument subclasses tend to become simpler in deep complex inheritance trees and will therefore increase the ability to assess high reliability of the subclasses This presents another related problem composing reusable subclasses that are reliable Polymorphism is di cult to test i e nd test cases to exercise di er ent binding scenarios However from our previous intuition and this e ort s experimentation polymorphism when faulty will likely cause the faults to be of larger sizes suggesting decreased error masking Therefore polymorphism is not problematic for system level testing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A survey on digital data hiding schemes: principals, algorithms, and applications

This paper investigates digital data hiding schemes. The concept of information hiding will be explained at first, and its traits, requirements, and applications will be described subsequently. In order to design a digital data hiding system, one should first become familiar with the concepts and criteria of information hiding. Having knowledge about the host signal, which may be audio, image, ...

متن کامل

Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions

The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. The mismatch is sound if the invariants depend only on encapsulated state, but encapsulation is problematic in contemporary software due to the many uses of shared mutable objects. The mismatch is formalized here in a proof rule ...

متن کامل

Local Reasoning and Information Hiding in SCAP

Separation logic supports state-modular program verification in two aspects: local reasoning by means of the ordinary (first-order) frame rule and information hiding by the hypothetical frame rule (a second-order frame rule). In this paper, we show the support of local reasoning and information hiding in SCAP, a program logic for low-level programs with stack-based control abstractions. We show...

متن کامل

Chapter 1 An Overview

Separation logic is a novel system for reasoning about imperative programs. It extends Hoare logic with enriched assertions that can describe the separation of storage and other resources concisely. The original goal of the logic was to facilitate reasoning about shared mutable data structures, i.e., structures where updatable fields can be referenced from more than one point. More recently, th...

متن کامل

A Systematic Approach to Anonymity

Personal information anonymity concerns anonymizing information that identifies individuals, in contrast to anonymizing activities such as downloading copyrighted items on the Internet. It may refer to encrypting personal data, generalization and suppression as in k-anonymization, ‘untraceability’ or ‘unidentifiability’ of identity in the network, etc. A common notion is hiding the “identities”...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997